package com.xinxin.leetcode.problem509;

/**
 * @author ShiXinXin
 * @date 2020-01-11 23:20
 */
class Solution {
    private static final int[] ARR = {0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946, 17711, 28657, 46368, 75025, 121393, 196418, 317811, 514229, 832040};
    public int fib(int N) {
        return ARR[N];
    }

    public static void main(String[] args) {
        for (int i = 0; i <= 30; i++) {
            System.out.print(new Solution().fib(i) + ",");
        }
    }
}
